Countably categorical coloured linear orders
نویسندگان
چکیده
In this paper, we give a classification of (finite or countable) א0categorical coloured linear orders, generalizing Rosenstein’s characterization of א0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and Qn-combinations (for n ≥ 1). We give a method using coding trees to describe all structures in our list.
منابع مشابه
Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite ordered structures with finitely many partial equivalence relations with convex classes.
متن کاملAlgebras of Distributions of Binary Semi-isolating Formulas for Families of Isolated Types and for Countably Categorical Theories
We apply a general approach for distributions of binary isolating and semi-isolating formulas to families of isolated types and to the class of countably categorical theories. Containing compositions and Boolean combinations, structures associated with binary formulas linking isolated types in general case and for ω-categorical theories are characterized. Mathematics Subject Classification: 03C...
متن کاملComputability and uncountable Linear Orders I: Computable Categoricity
We study the computable structure theory of linear orders of size א1 within the framework of admissible computability theory. In particular, we characterize which of these linear orders are computably categorical.
متن کاملClassification of Finite Coloured Linear Orderings
This paper concerns the classification of finite coloured linear orders up to n-equivalence. Ehrenfeucht-Fräıssé games are used to define what this means, and also to help analyze such structures. We give an explicit bound for the least number g(m, n) such that any finite m-coloured linear order is n-equivalent to some ordering of size ≤ g(m, n), from which it follows that g is computable. We g...
متن کاملא0-categorical Groups and Their Completions
1 2 3 We embed a countably categorical group G into a locally compact group G with a non-trivial topology and study how topological properties of G are connected with the structure of definable subgroups of G .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 56 شماره
صفحات -
تاریخ انتشار 2010